Sciweavers

221 search results - page 17 / 45
» New formulations for the Kissing Number Problem
Sort
View
CIKM
2011
Springer
13 years 9 months ago
Factorization-based lossless compression of inverted indices
Many large-scale Web applications that require ranked top-k retrieval are implemented using inverted indices. An inverted index represents a sparse term-document matrix, where non...
George Beskales, Marcus Fontoura, Maxim Gurevich, ...
MOBIHOC
2006
ACM
15 years 9 months ago
Mobile backbone networks --: construction and maintenance
We study a novel hierarchical wireless networking approach in which some of the nodes are more capable than others. In such networks, the more capable nodes can serve as Mobile Ba...
Anand Srinivas, Gil Zussman, Eytan Modiano
PAMI
2010
276views more  PAMI 2010»
14 years 8 months ago
Local-Learning-Based Feature Selection for High-Dimensional Data Analysis
—This paper considers feature selection for data classification in the presence of a huge number of irrelevant features. We propose a new feature selection algorithm that addres...
Yijun Sun, Sinisa Todorovic, Steve Goodison
JMLR
2006
138views more  JMLR 2006»
14 years 9 months ago
Noisy-OR Component Analysis and its Application to Link Analysis
We develop a new component analysis framework, the Noisy-Or Component Analyzer (NOCA), that targets high-dimensional binary data. NOCA is a probabilistic latent variable model tha...
Tomás Singliar, Milos Hauskrecht
CCE
2004
14 years 9 months ago
Dynamic programming in a heuristically confined state space: a stochastic resource-constrained project scheduling application
The Resource-Constrained Project Scheduling Problem(RCPSP) is a significant challenge in highly regulated industries, such as pharmaceuticals and agrochemicals, where a large numb...
Jaein Choi, Matthew J. Realff, Jay H. Lee