2693 search results - page 238 / 539 » On Computing Complex Navigation Functions |
175
click to vote
ICALP
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
232
click to vote
ACL2
2006
ACM
16 years 18 days ago
2006
ACM
To make it practical to mechanize proofs in programming language metatheory, several capabilities are required of the theorem proving framework. One must be able to represent and ...
169
click to vote
COMPGEOM
1997
ACM
15 years 10 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
195
click to vote
EXACT
2008
15 years 9 months ago
2008
The monitoring of properties of complex software systems can provide the core functionality for detecting violations of such properties. However, the violations detection cannot be...
193
click to vote
DAIS
2010
15 years 8 months ago
2010
The growing needs in computational power to answer to the increasing number of on-line services and the complexity of applications makes it mandatory to build corresponding hardwar...