Sciweavers

4377 search results - page 267 / 876
» Mass problems and randomness
Sort
View
ICALP
2005
Springer
16 years 6 days ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
COCOON
2005
Springer
15 years 8 months ago
On-Line Algorithms for Market Equilibria
We consider a variation of the classical problem of finding prices which guarantee equilibrium in linear markets consisting of divisible goods and agents with money. Specificall...
Spyros Angelopoulos, Atish Das Sarma, Avner Magen,...
JNCA
2011
281views more  JNCA 2011»
14 years 9 months ago
A link stability-based multicast routing protocol for wireless mobile ad hoc networks
  Recently, several studies have been conducted to design mobility‐based multicast routing protocols for    wireless mobile ad hoc networks (MANET). These ...
Javad Akbari Torkestani, Mohammad Reza Meybodi
ECCV
2008
Springer
16 years 8 months ago
Robust Multiple Structures Estimation with J-Linkage
This paper tackles the problem of fitting multiple instances of a model to data corrupted by noise and outliers. The proposed solution is based on random sampling and conceptual da...
Roberto Toldo, Andrea Fusiello
SAT
2005
Springer
162views Hardware» more  SAT 2005»
16 years 5 days ago
Heuristics for Fast Exact Model Counting
An important extension of satisfiability testing is model-counting, a task that corresponds to problems such as probabilistic reasoning and computing the permanent of a Boolean ma...
Tian Sang, Paul Beame, Henry A. Kautz