Sciweavers

1522 search results - page 81 / 305
» On the Complexity of Several Haplotyping Problems
Sort
View
WWW
2008
ACM
14 years 8 months ago
Offline matching approximation algorithms in exchange markets
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
Zeinab Abbassi, Laks V. S. Lakshmanan
LCPC
1997
Springer
13 years 12 months ago
Automatic Data Decomposition for Message-Passing Machines
The data distribution problem is very complex, because it involves trade-offdecisions between minimizing communication and maximizing parallelism. A common approach towards solving...
Mirela Damian-Iordache, Sriram V. Pemmaraju
CVPR
2012
IEEE
11 years 10 months ago
On multiple foreground cosegmentation
In this paper, we address a challenging image segmentation problem called multiple foreground cosegmentation (MFC), which concerns a realistic scenario in general Webuser photo se...
Gunhee Kim, Eric P. Xing
C5
2006
IEEE
14 years 1 months ago
A Buffer Framework for Supporting Responsive Interaction in Information Visualization Interfaces
We present a framework that we are developing to better solve several critical issues that arise when interactive systems are extended to large displays. These issues include slow...
Tobias Isenberg, André Miede, M. Sheelagh T...
AROBOTS
2004
119views more  AROBOTS 2004»
13 years 7 months ago
Swarm-Bot: A New Distributed Robotic Concept
The swarm intelligence paradigm has proven to have very interesting properties such as robustness, flexibility and ability to solve complex problems exploiting parallelism and self...
Francesco Mondada, Giovanni C. Pettinaro, Andr&eac...