Sciweavers

236 search results - page 11 / 48
» From Weak to Strong Watermarking
Sort
View
COORDINATION
2009
Springer
14 years 4 months ago
Fairness for Chorded Languages
Joins or chords is a concurrency construct that seems to fit well with the object oriented paradigm. Chorded languages are presented with implicit assumptions regarding the fair t...
Alexis Petrounias, Susan Eisenbach
ICPR
2010
IEEE
14 years 2 months ago
Active Boosting for Interactive Object Retrieval
This paper presents a new algorithm based on boosting for interactive object retrieval in images. Recent works propose ”online boosting” algorithms where weak classifier sets...
Alexis Lechervy, Philippe Henri Gosselin, Frederic...
EJC
2010
13 years 10 months ago
On the infinitesimal rigidity of weakly convex polyhedra
The main motivation here is a question: whether any polyhedron which can be subdivided into convex pieces without adding a vertex, and which has the same vertices as a convex poly...
Robert Connelly, Jean-Marc Schlenker
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 3 months ago
Detecting Backdoor Sets with Respect to Horn and Binary Clauses
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
ICCCN
1998
IEEE
14 years 2 months ago
On the Vulnerabilities and Protection of OSPF Routing Protocol
This paper analyzes both the strong points and weak points of OSPF routing protocol from security perspective. On its strong points, we abstract its features of information least ...
Feiyi Wang, Shyhtsun Felix Wu