Sciweavers

3991 search results - page 177 / 799
» Bounding homogeneous models
Sort
View
COMPGEOM
1992
ACM
14 years 9 days ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl
APVIS
2011
12 years 8 months ago
Edge maps: Representing flow with bounded error
Robust analysis of vector fields has been established as an important tool for deriving insights from the complex systems these fields model. Many analysis techniques rely on co...
Harsh Bhatia, Shreeraj Jadhav, Peer-Timo Bremer, G...
FCT
2005
Springer
14 years 1 months ago
The Complexity of Querying External Memory and Streaming Data
We review a recently introduced computation model for streaming and external memory data. An important feature of this model is that it distinguishes between sequentially reading (...
Martin Grohe, Christoph Koch, Nicole Schweikardt
ACTA
2007
92views more  ACTA 2007»
13 years 8 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
GLOBECOM
2009
IEEE
14 years 2 days ago
Stochastic Network Calculus Models under Max-Plus Algebra
A challenging research issue of analyzing networks where packets are served probabilistically, such as multi-access networks and wireless networks, is to characterize the stochasti...
Jing Xie, Yuming Jiang