Sciweavers

6315 search results - page 106 / 1263
» Approximating Solution Structure
Sort
View
123
Voted
DAM
2008
114views more  DAM 2008»
15 years 3 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
106
Voted
JAIR
2008
102views more  JAIR 2008»
15 years 3 months ago
An Ordinal Bargaining Solution with Fixed-Point Property
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
Dongmo Zhang, Yan Zhang
SIAMMA
2011
98views more  SIAMMA 2011»
14 years 10 months ago
Time-Periodic Linearized Solutions of the Compressible Euler Equations and a Problem of Small Divisors
It has been unknown since the time of Euler whether or not time-periodic sound wave propagation is physically possible in the compressible Euler equations, due mainly to the ubiqui...
Blake Temple, Robin Young
FOCS
2008
IEEE
15 years 9 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder
ICDE
2005
IEEE
135views Database» more  ICDE 2005»
16 years 4 months ago
Finding (Recently) Frequent Items in Distributed Data Streams
We consider the problem of maintaining frequency counts for items occurring frequently in the union of multiple distributed data streams. Na?ive methods of combining approximate f...
Amit Manjhi, Vladislav Shkapenyuk, Kedar Dhamdhere...