4886 search results - page 650 / 978 » Approximate Data Exchange |
208
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
We consider the view selection problem for XML content based routing: given a network, in which a stream of XML documents is routed and the routing decisions are taken based on re...
164
Voted
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
185
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
173
click to vote
SIGIR
1998
ACM
15 years 11 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....
304
click to vote
NLP
2000
15 years 10 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...