1802 search results - page 160 / 361 » Complexity Theory for Operators in Analysis |
201
click to vote
TALG
2008
15 years 6 months ago
2008
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
186
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
137
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
A requirement common to most dynamic vision applications is the ability to track objects in a sequence of frames. This problem has been extensively studied in the past few years, ...
193
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
149
click to vote
WSC
2001
15 years 7 months ago
2001
In models of military operations it is important to include the Command and Control (C2) process in order to achieve a realistic simulation of a military force's behaviour an...