Sciweavers

1522 search results - page 137 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
TIT
2008
115views more  TIT 2008»
14 years 9 months ago
Affine Reflection Group Codes
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
Terasan Niyomsataya, Ali Miri, Monica Nevins
TKDE
2008
121views more  TKDE 2008»
14 years 9 months ago
On Modularity Clustering
Modularity is a recently introduced quality measure for graph clusterings. It has immediately received considerable attention in several disciplines, and in particular in the compl...
Ulrik Brandes, Daniel Delling, Marco Gaertler, Rob...
TOG
2008
120views more  TOG 2008»
14 years 9 months ago
Real-time, all-frequency shadows in dynamic scenes
Shadow computation in dynamic scenes under complex illumination is a challenging problem. Methods based on precomputation provide accurate, real-time solutions, but are hard to ex...
Thomas Annen, Zhao Dong, Tom Mertens, Philippe Bek...
AI
2002
Springer
14 years 9 months ago
Conditional independence in propositional logic
Independence--the study of what is relevant to a given problem of reasoning--is an important AI topic. In this paper, we investigate several notions of conditional independence in...
Jérôme Lang, Paolo Liberatore, Pierre...
IJCV
2000
97views more  IJCV 2000»
14 years 9 months ago
Contour Tracking in Clutter: A Subset Approach
A new method for tracking contours of moving objects in clutter is presented. For a given object, a model of its contours is learned from training data in the form of a subset of c...
Daniel Freedman, Michael S. Brandstein