Sciweavers

321 search results - page 44 / 65
» Enabling local computation for partially ordered preferences
Sort
View
RECOMB
2001
Springer
14 years 7 months ago
Algorithms for phylogenetic footprinting
Phylogenetic footprinting is a comparative genomics approach for predicting transcription factor binding sites, where a set of orthologous regulatory regions are compared and short...
Mathieu Blanchette
SC
2003
ACM
14 years 24 days ago
SCALLOP: A Highly Scalable Parallel Poisson Solver in Three Dimensions
SCALLOP is a highly scalable solver and library for elliptic partial differential equations on regular block-structured domains. SCALLOP avoids high communication overheads algor...
Gregory T. Balls, Scott B. Baden, Phillip Colella
CLOR
2006
13 years 11 months ago
Video Google: Efficient Visual Search of Videos
We describe an approach to object retrieval which searches for and localizes all the occurrences of an object in a video, given a query image of the object. The object is represent...
Josef Sivic, Andrew Zisserman
TCS
2008
13 years 7 months ago
New constructions for provably-secure time-bound hierarchical key assignment schemes
A time-bound hierarchical key assignment scheme is a method to assign time-dependent encryption keys to a set of classes in a partially ordered hierarchy, in such a way that each ...
Alfredo De Santis, Anna Lisa Ferrara, Barbara Masu...
ICIP
2006
IEEE
14 years 9 months ago
Exploiting Spatial Redundancy in Pixel Domain Wyner-Ziv Video Coding
Distributed video coding is a recent paradigm that enables a flexible distribution of the computational complexity between the encoder and the decoder building on top of distribut...
Alan Trapanese, Catarina Brites, Fernando Pereira,...