4894 search results - page 478 / 979 » The Guarding Problem - Complexity and Approximation |
132
click to vote
EDBT
2009
ACM
15 years 12 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
148
Voted
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
152
click to vote
INFOCOM
2008
IEEE
15 years 11 months ago
2008
IEEE
—The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center performs an opti...
142
click to vote
GRC
2007
IEEE
15 years 11 months ago
2007
IEEE
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
174
click to vote
WINE
2007
Springer
15 years 11 months ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...