Sciweavers

2740 search results - page 366 / 548
» Approximating Component Selection
Sort
View
ACID
2006
220views Algorithms» more  ACID 2006»
15 years 2 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
101
Voted
FLAIRS
2003
15 years 2 months ago
Spatially-Aware Information Retrieval with Graph-Based Qualitative Reference Models
Geo-referenced information is used by a growing number of “spatially-aware” tools in different application areas, including tourism, marketing, environmental management, and m...
Thomas Vögele, Christoph Schlieder
UAI
2001
15 years 2 months ago
Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
Daniel Pless, George F. Luger
NIPS
2003
15 years 2 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi
91
Voted
NIPS
2003
15 years 2 months ago
Distributed Optimization in Adaptive Networks
We develop a protocol for optimizing dynamic behavior of a network of simple electronic components, such as a sensor network, an ad hoc network of mobile devices, or a network of ...
Ciamac Cyrus Moallemi, Benjamin Van Roy