Sciweavers

1679 search results - page 162 / 336
» Strong order equivalence
Sort
View
SIGMOD
2008
ACM
101views Database» more  SIGMOD 2008»
14 years 9 months ago
Pay-as-you-go user feedback for dataspace systems
A primary challenge to large-scale data integration is creating semantic equivalences between elements from different data sources that correspond to the same real-world entity or...
Shawn R. Jeffery, Michael J. Franklin, Alon Y. Hal...
CSB
2004
IEEE
164views Bioinformatics» more  CSB 2004»
14 years 23 days ago
Biclustering in Gene Expression Data by Tendency
The advent of DNA microarray technologies has revolutionized the experimental study of gene expression. Clustering is the most popular approach of analyzing gene expression data a...
Jinze Liu, Jiong Yang, Wei Wang 0010
CP
2008
Springer
13 years 10 months ago
Model Restarts for Structural Symmetry Breaking
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann,...
SODA
2003
ACM
167views Algorithms» more  SODA 2003»
13 years 10 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
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
13 years 9 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna