4843 search results - page 467 / 969 » The Shortcut Problem - Complexity and Approximation |
163
click to vote
ESA
2009
Springer
16 years 21 days 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...
168
Voted
INFOCOM
2008
IEEE
16 years 17 days 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...
159
Voted
GRC
2007
IEEE
16 years 14 days 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...
192
click to vote
WINE
2007
Springer
16 years 7 days 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...
160
Voted
APPT
2005
Springer
15 years 11 months ago
2005
Springer
Identifying the patterns of large data sets is a key requirement in data mining. A powerful technique for this purpose is the principal component analysis (PCA). PCA-based clusteri...