10608 search results - page 256 / 2122 » Complexity of O'Hara's Algorithm |
124
click to vote
BIRTHDAY
2003
Springer
15 years 9 months ago
2003
Springer
The pagination problem of complex documents is in placing text and floating objects on pages in such a way that each object appears close to, but not before, its text reference. ...
129
click to vote
STOC
2010
ACM
15 years 9 months ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
139
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
162
click to vote
CIKM
2008
Springer
15 years 6 months ago
2008
Springer
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
149
click to vote
MKWI
2008
15 years 5 months ago
2008
: Matchmaking between offers and requests is an essential mechanism in electronic market places. Description Logics have been proposed as a appropriate framework for representing o...