Sciweavers

330 search results - page 35 / 66
» Algorithms for Propositional Model Counting
Sort
View
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
15 years 11 months ago
Data-Specific Analysis of String Sorting
We consider the complexity of sorting strings in the model that counts comparisons between symbols and not just comparisons between strings. We show that for any set of strings S ...
Raimund Seidel
SIGIR
1999
ACM
15 years 6 months ago
Probabilistic Latent Semantic Indexing
Probabilistic Latent Semantic Indexing is a novel approach to automated document indexing which is based on a statistical latent class model for factor analysis of count data. Fit...
Thomas Hofmann
SAT
2004
Springer
106views Hardware» more  SAT 2004»
15 years 7 months ago
Local Search with Bootstrapping
We propose and study a technique to improve the performance of those local-search SAT solvers that proceed by executing a prespecified number of tries, each starting with an eleme...
Lengning Liu, Miroslaw Truszczynski
CLUSTER
2002
IEEE
15 years 2 months ago
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
Susanta Datta, Ivan Stojmenovic, Jie Wu
SPIRE
2004
Springer
15 years 7 months ago
Indexing Text Documents Based on Topic Identification
This work provides algorithms and heuristics to index text documents by determining important topics in the documents. To index text documents, the work provides algorithms to gene...
Manonton Butarbutar, Susan McRoy