Sciweavers

1024 search results - page 148 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
ICDE
2010
IEEE
258views Database» more  ICDE 2010»
14 years 3 months ago
Anonymized Data: Generation, models, usage
Data anonymization techniques have been the subject of intense investigation in recent years, for many kinds of structured data, including tabular, item set and graph data. They e...
Graham Cormode, Divesh Srivastava
RECOMB
2005
Springer
14 years 9 months ago
Pairwise Local Alignment of Protein Interaction Networks Guided by Models of Evolution
Abstract. With ever increasing amount of available data on protein-protein interaction (PPI) networks and research revealing that these networks evolve at a modular level, discover...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 9 months ago
Quadratic forms on graphs
We introduce a new graph parameter, called the Grothendieck constant of a graph G = (V, E), which is defined as the least constant K such that for every A : E R, sup f:V S|V |-1 ...
Noga Alon, Konstantin Makarychev, Yury Makarychev,...
MMSEC
2006
ACM
160views Multimedia» more  MMSEC 2006»
14 years 2 months ago
Extraction in software watermarking
The widespread use of the Internet makes software piracy and unauthorized modification easier and more frequent. Among the many techniques developed for protecting software copyr...
William Zhu, Clark D. Thomborson
ECP
1997
Springer
128views Robotics» more  ECP 1997»
14 years 26 days ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea