Sciweavers

1289 search results - page 18 / 258
» Complexity of Counting the Optimal Solutions
Sort
View
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
14 years 11 months ago
Optimizing complex extraction programs over evolving text data
Most information extraction (IE) approaches have considered only static text corpora, over which we apply IE only once. Many real-world text corpora however are dynamic. They evol...
Fei Chen 0002, Byron J. Gao, AnHai Doan, Jun Yang ...
WDAG
1998
Springer
123views Algorithms» more  WDAG 1998»
14 years 3 months ago
Propagation and Leader Election in a Multihop Broadcast Environment
The paper addresses the problemof solving classic distributed algorithmic problems under the practical model of Broadcast Communication Networks. Our main result is a new Leader El...
Israel Cidon, Osnat Mokryn
CI
2004
116views more  CI 2004»
13 years 10 months ago
Solution Generation with Qualitative Models of Preferences
We consider automated decision aids that help users select the best solution from a large set of options. For such tools to successfully accomplish their task, eliciting and repre...
Boi Faltings, Marc Torrens, Pearl Pu
ATAL
2004
Springer
14 years 4 months ago
Approximate Solutions for Partially Observable Stochastic Games with Common Payoffs
Partially observable decentralized decision making in robot teams is fundamentally different from decision making in fully observable problems. Team members cannot simply apply si...
Rosemary Emery-Montemerlo, Geoffrey J. Gordon, Jef...
NIPS
1992
14 years 2 days ago
Some Solutions to the Missing Feature Problem in Vision
In visual processing the ability to deal with missing and noisy information is crucial. Occlusions and unreliable feature detectors often lead to situations where little or no dir...
Subutai Ahmad, Volker Tresp