516 search results - page 99 / 104 » Generalizing the Discrete Timed Automaton |
80
Voted
WSDM
2009
ACM
15 years 6 months ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
101
Voted
IROS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract— LDP (Locally Distributed Predicates) is a distributed, high-level language for programming modular reconfigurable robot systems (MRRs). In this paper we present the im...
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper addresses the problem of planning for goal directed navigation in the environment that contains a number of possible adversary locations. It first shows that common...
111
click to vote
CIKM
2007
Springer
15 years 5 months ago
2007
Springer
We consider the problem of document indexing and representation. Recently, Locality Preserving Indexing (LPI) was proposed for learning a compact document subspace. Different from...
93
Voted
COCOA
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...