Sciweavers

1208 search results - page 57 / 242
» On Counting Generalized Colorings
Sort
View
ESA
2010
Springer
220views Algorithms» more  ESA 2010»
13 years 10 months ago
Data Structures for Storing Small Sets in the Bitprobe Model
abstract appeared in Proc. 24th Annual Symposium of Computational Geometry (SoCG), 2008, pp. 338-345. S. Shannigrahi and S. P. Pal, "Efficient Prufer-like Coding and Counting ...
Jaikumar Radhakrishnan, Smit Shah 0001, Saswata Sh...
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 9 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
CORR
2007
Springer
147views Education» more  CORR 2007»
13 years 9 months ago
Decomposition During Search for Propagation-Based Constraint Solvers
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
Martin Mann, Guido Tack, Sebastian Will
IPSN
2007
Springer
14 years 3 months ago
Tracking multiple targets using binary proximity sensors
Recent work has shown that, despite the minimal information provided by a binary proximity sensor, a network of such sensors can provide remarkably good target tracking performanc...
Jaspreet Singh, Upamanyu Madhow, Rajesh Kumar 0003...
MINENET
2006
ACM
14 years 3 months ago
Forensic analysis of autonomous system reachability
Security incidents have an adverse impact not only on end systems, but also on Internet routing, resulting in many out-of-reach prefixes. Previous work has looked at performance ...
D. K. Lee, Sue B. Moon, Taesang Choi, Taesoo Jeong