Sciweavers

216 search results - page 43 / 44
» Edge Search Number of Cographs in Linear Time
Sort
View
DAM
1999
100views more  DAM 1999»
13 years 7 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
ICCS
2007
Springer
14 years 1 months ago
Dynamic Tracking of Facial Expressions Using Adaptive, Overlapping Subspaces
We present a Dynamic Data Driven Application System (DDDAS) to track 2D shapes across large pose variations by learning non-linear shape manifold as overlapping, piecewise linear s...
Dimitris N. Metaxas, Atul Kanaujia, Zhiguo Li
WECWIS
2003
IEEE
132views ECommerce» more  WECWIS 2003»
14 years 26 days ago
Page Digest for Large-Scale Web Services
The rapid growth of the World Wide Web and the Internet has fueled interest in Web services and the Semantic Web, which are quickly becoming important parts of modern electronic c...
Daniel Rocco, David Buttler, Ling Liu
AAAI
2006
13 years 9 months ago
Computing Slater Rankings Using Similarities among Candidates
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One important voting rule is the Slater rule. It selects a ranking of the alte...
Vincent Conitzer
TIT
2002
126views more  TIT 2002»
13 years 7 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy