Sciweavers

4860 search results - page 513 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
DM
2008
50views more  DM 2008»
15 years 4 months ago
Searching monotone multi-dimensional arrays
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin
COR
2006
65views more  COR 2006»
15 years 4 months ago
An exact method for graph coloring
We are interested in the graph coloring problem. We propose an exact method based on a linear-decomposition of the graph. The complexity of this method is exponential according to...
Corinne Lucet, Florence Mendes, Aziz Moukrim
IJFCS
2007
77views more  IJFCS 2007»
15 years 4 months ago
Optimal Construction of Sense of Direction in a Torus by a Mobile Agent
Sense of direction is a property of the edge-labeling of a network whose availability facilitates computations and often decreases their complexity. In this paper we consider the ...
Hanane Becha, Paola Flocchini
TIT
2008
115views more  TIT 2008»
15 years 4 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
129
Voted
IJCV
2000
97views more  IJCV 2000»
15 years 4 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