Sciweavers

1523 search results - page 279 / 305
» Partially ordered secretaries
Sort
View
84
Voted
EUROCAST
2005
Springer
102views Hardware» more  EUROCAST 2005»
15 years 3 months ago
Approximation Problems Categories
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
Liara Aparecida dos Santos Leal, Dalcidio Moraes C...
109
Voted
VLDB
2005
ACM
136views Database» more  VLDB 2005»
15 years 3 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
85
Voted
VLDB
2005
ACM
126views Database» more  VLDB 2005»
15 years 3 months ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...
82
Voted
CP
2005
Springer
15 years 3 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
112
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...