Sciweavers

2340 search results - page 15 / 468
» Copying and Comparing: Problems and Solutions
Sort
View
SIAMSC
2008
193views more  SIAMSC 2008»
14 years 11 months ago
Exact and Approximate Sparse Solutions of Underdetermined Linear Equations
Abstract. In this paper, we empirically investigate the NP-hard problem of finding sparsest solutions to linear equation systems, i.e., solutions with as few nonzeros as possible. ...
Sadegh Jokar, Marc E. Pfetsch
ATAL
2006
Springer
15 years 3 months ago
Learning the task allocation game
The distributed task allocation problem occurs in domains like web services, the grid, and other distributed systems. In this problem, the system consists of servers and mediators...
Sherief Abdallah, Victor R. Lesser
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
15 years 1 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 5 hour ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
SIGIR
2006
ACM
15 years 5 months ago
Thread detection in dynamic text message streams
Text message stream is a newly emerging type of Web data which is produced in enormous quantities with the popularity of Instant Messaging and Internet Relay Chat. It is benefici...
Dou Shen, Qiang Yang, Jian-Tao Sun, Zheng Chen