Sciweavers

2286 search results - page 326 / 458
» Algorithms for Categorical Equivalence
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
What Can We Learn Privately?
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...
DGCI
2009
Springer
15 years 9 months ago
Optimal Partial Tiling of Manhattan Polyominoes
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
Olivier Bodini, Jérémie Lumbroso
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 8 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ALGORITHMICA
2007
86views more  ALGORITHMICA 2007»
15 years 6 months ago
Detecting Holes and Antiholes in Graphs
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
Stavros D. Nikolopoulos, Leonidas Palios
BMCBI
2004
158views more  BMCBI 2004»
15 years 6 months ago
Improvement of alignment accuracy utilizing sequentially conserved motifs
Background: Multiple sequence alignment algorithms are very important tools in molecular biology today. Accurate alignment of proteins is central to several areas such as homology...
Saikat Chakrabarti, Nitin Bhardwaj, Prem A. Anand,...