Sciweavers

3019 search results - page 309 / 604
» Approximating the Domatic Number
Sort
View
FSTTCS
2010
Springer
15 years 4 months ago
Finding Independent Sets in Unions of Perfect Graphs
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
CVPR
2008
IEEE
16 years 8 months ago
Sequential sparsification for change detection
This paper presents a general method for segmenting a vector valued sequence into an unknown number of subsequences where all data points from a subsequence can be represented wit...
Necmiye Ozay, Mario Sznaier, Octavia I. Camps
CP
2009
Springer
16 years 7 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
EDBT
2008
ACM
160views Database» more  EDBT 2008»
16 years 6 months ago
Why go logarithmic if we can go linear?: Towards effective distinct counting of search traffic
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
Ahmed Metwally, Divyakant Agrawal, Amr El Abbadi
EDBT
2008
ACM
178views Database» more  EDBT 2008»
16 years 6 months ago
Compacting music signatures for efficient music retrieval
Music information retrieval is becoming very important with the ever-increasing growth of music content in digital libraries, peer-to-peer systems and the internet. While it is ea...
Bin Cui, H. V. Jagadish, Beng Chin Ooi, Kian-Lee T...