2137 search results - page 392 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
201
click to vote
SIGMOD
2008
ACM
16 years 2 months ago
2008
ACM
Discovering a bucket order B from a collection of possibly noisy full rankings is a fundamental problem that relates to various applications involving rankings. Informally, a buck...
131
click to vote
OOPSLA
2005
Springer
15 years 7 months ago
2005
Springer
We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environmen...
130
click to vote
IWCMC
2006
ACM
15 years 8 months ago
2006
ACM
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
142
click to vote
BMCBI
2011
14 years 5 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
139
click to vote
OPODIS
2004
15 years 3 months ago
2004
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...