Sciweavers

4112 search results - page 501 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
223
Voted
IWCMC
2006
ACM
16 years 1 months ago
Modeling key agreement in multi-hop ad hoc networks
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...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
AIPS
2008
15 years 9 months ago
Fast Dynamic Scheduling of Disjunctive Temporal Constraint Networks through Incremental Compilation
Autonomous systems operating in real-world environments must plan, schedule, and execute missions while robustly adapting to uncertainty and disturbance. One way to mitigate the e...
Julie A. Shah, Brian C. Williams
OPODIS
2004
15 years 9 months ago
Self-optimizing DHTs Using Request Profiling
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...
Alina Bejan, Sukumar Ghosh
CVPR
2000
IEEE
16 years 9 months ago
A Curve Evolution Approach to Smoothing and Segmentation Using the Mumford-Shah Functional
In this work, we approach the classic Mumford-Shah problem from a curve evolution perspective. In particular, we let a given family of curves define the boundaries between regions...
Andy Tsai, Anthony J. Yezzi, Alan S. Willsky
271
Voted
SIGMOD
2006
ACM
117views Database» more  SIGMOD 2006»
16 years 7 months ago
Database support for matching: limitations and opportunities
We define a match join of R and S with predicate to be a subset of the -join of R and S such that each tuple of R and S contributes to at most one result tuple. Match joins and t...
Ameet Kini, Srinath Shankar, Jeffrey F. Naughton, ...