Sciweavers

2111 search results - page 151 / 423
» Understanding the Yarowsky Algorithm
Sort
View
PERVASIVE
2008
Springer
14 years 10 months ago
Microsearch: When Search Engines Meet Small Devices
Abstract. In this paper, we present Microsearch, a search system suitable for small devices used in ubiquitous computing environments. Akin to a desktop search engine, Microsearch ...
Chiu Chiang Tan, Bo Sheng, Haodong Wang, Qun Li
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
14 years 10 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
JAIR
2000
123views more  JAIR 2000»
14 years 9 months ago
Backbone Fragility and the Local Search Cost Peak
The local search algorithm WSat is one of the most successful algorithms for solving the satisfiability (SAT) problem. It is notably effective at solving hard Random 3-SAT instanc...
Josh Singer, Ian P. Gent, Alan Smaill
IDA
2002
Springer
14 years 9 months ago
Evolutionary model selection in unsupervised learning
Feature subset selection is important not only for the insight gained from determining relevant modeling variables but also for the improved understandability, scalability, and pos...
YongSeog Kim, W. Nick Street, Filippo Menczer
AC
1998
Springer
14 years 9 months ago
Cellular Automata Models of Self-Replicating Systems
Abstract: Since von Neumann's seminal work around 1950, computer scientists and others have studied the algorithms needed to support self-replicating systems. Much of this wor...
James A. Reggia, Hui-Hsien Chou, Jason D. Lohn