Sciweavers

340 search results - page 59 / 68
» Approximate equality is no fuzzy equality
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
INFOCOM
2008
IEEE
14 years 1 months ago
Queueing Analysis of Loss Systems with Variable Optical Delay Lines
—Recently, a new optical device called variable optical delay line (VODL) has been proposed in the literature. As suggested by its name, the delay of a VODL can be dynamically se...
Duan-Shin Lee, Cheng-Shang Chang, Jay Cheng, Horng...
CIKM
2005
Springer
14 years 28 days ago
Towards estimating the number of distinct value combinations for a set of attributes
Accurately and efficiently estimating the number of distinct values for some attribute(s) or sets of attributes in a data set is of critical importance to many database operation...
Xiaohui Yu, Calisto Zuzarte, Kenneth C. Sevcik
ISCAPDCS
2001
13 years 8 months ago
Optimal Broadcasting in Injured Hypercubes Using Directed Safety Levels
Reliable communication in injured hypercubes with faulty links/nodes using directed safety levels is studied in this paper. In this approach, each node u in an n-dimensional hyper...
Jie Wu
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
13 years 8 months ago
Counting inversions in lists
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
Anupam Gupta, Francis Zane