13376 search results - page 2435 / 2676 » Problem Solving with |
114
click to vote
WPES
2003
ACM
15 years 9 months ago
2003
ACM
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
124
click to vote
CDC
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— In this paper we consider several problems involving control with limited actuation and sampling rates. Event-based control has emerged as an attractive approach for ad...
159
click to vote
TACS
2001
Springer
15 years 8 months ago
2001
Springer
The state of the practice in object-oriented software development has moved beyond reuse of code to reuse of conceptual structures such as design patterns. This paper draws attenti...
152
Voted
DATE
2004
IEEE
15 years 7 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
133
click to vote
DNA
2006
Springer
15 years 7 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...