Sciweavers

16666 search results - page 2555 / 3334
» Descriptive and Computational Complexity
Sort
View
DIS
2007
Springer
15 years 11 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
ECCV
2010
Springer
15 years 11 months ago
Detection and Tracking of Large Number of Targets in Wide Area Surveillance
In this paper, we tackle the problem of object detection and tracking in a new and challenging domain of wide area surveillance. This problem poses several challenges: large camera...
CONCUR
2009
Springer
15 years 11 months ago
Time-Bounded Verification
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Joël Ouaknine, Alexander Rabinovich, James Wo...
ECLIPSE
2007
ACM
15 years 11 months ago
Building, deploying, and monitoring distributed applications with Eclipse and R-OSGI
Designing and testing distributed applications is still a difficult task that requires in-depth knowledge about networking issues. Eclipse is, among other things, a powerful and w...
Jan S. Rellermeyer, Gustavo Alonso, Timothy Roscoe
EDOC
2007
IEEE
15 years 11 months ago
Automated Model-Based Configuration of Enterprise Java Applications
The decentralized process of configuring enterprise applications is complex and error-prone, involving multiple participants/roles and numerous configuration changes across multipl...
Jules White, Douglas C. Schmidt, Krzysztof Czarnec...
« Prev « First page 2555 / 3334 Last » Next »