Sciweavers

1163 search results - page 149 / 233
» Embedding into Bipartite Graphs
Sort
View
STACS
2010
Springer
14 years 3 months ago
The Complexity of Approximating Bounded-Degree Boolean #CSP
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsen...
ICRA
2009
IEEE
164views Robotics» more  ICRA 2009»
14 years 2 months ago
Assigning cameras to subjects in video surveillance systems
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
Hazem El-Alfy, David Jacobs, Larry Davis
ICCCN
2008
IEEE
14 years 2 months ago
Localized Access Point Association in Wireless LANs with Bounded Approximation Ratio
— The current access point (AP) association schemes in wireless LANs, such as IEEE 802.11, cause an unbalanced load which reduces the performance of both the entire network and i...
Mingming Lu, Jie Wu
ICDM
2008
IEEE
136views Data Mining» more  ICDM 2008»
14 years 2 months ago
Document-Word Co-regularization for Semi-supervised Sentiment Analysis
The goal of sentiment prediction is to automatically identify whether a given piece of text expresses positive or negative opinion towards a topic of interest. One can pose sentim...
Vikas Sindhwani, Prem Melville
SIGIR
2006
ACM
14 years 2 months ago
Answering complex questions with random walk models
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
Sanda M. Harabagiu, V. Finley Lacatusu, Andrew Hic...