Sciweavers

257 search results - page 36 / 52
» Breaking Robert's Rules
Sort
View
ICALP
2004
Springer
14 years 1 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
COMPSAC
2002
IEEE
14 years 1 months ago
A Graphically Based Language for Constructing, Executing and Analysing Models of Software Systems
With computer systems becoming ever larger and more complex, the cost and effort associated with their construction is increasing and the systems are now sufficiently complex that...
Robert John Walters
FDL
2007
IEEE
13 years 12 months ago
Transaction Level Modelling: A reflection on what TLM is and how TLMs may be classified
Transaction-level modelling (TLM) is a poorlyterm, promising a level of abstraction like RTL (register transfer level), where the key feature is a `transaction'. But unlike r...
Mark Burton, James Aldis, Robert Günzel, Wolf...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
13 years 11 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó
JSAC
2006
96views more  JSAC 2006»
13 years 8 months ago
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...
Jang-Won Lee, Mung Chiang, A. Robert Calderbank