Sciweavers

9842 search results - page 1808 / 1969
» Problem complexity
Sort
View
PAMI
2010
222views more  PAMI 2010»
15 years 21 days ago
Minimal Surfaces Extend Shortest Path Segmentation Methods to 3D
—Shortest paths have been used to segment object boundaries with both continuous and discrete image models. Although these techniques are well defined in 2D, the character of the...
Leo Grady
RTAS
2010
IEEE
15 years 21 days ago
Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
Karthik Lakshmanan, Ragunathan Rajkumar
RV
2010
Springer
177views Hardware» more  RV 2010»
15 years 21 days ago
Runtime Instrumentation for Precise Flow-Sensitive Type Analysis
We describe a combination of runtime information and static analysis for checking properties of complex and configurable systems. The basic idea of our approach is to 1) let the p...
Etienne Kneuss, Philippe Suter, Viktor Kuncak
TKDE
2010
200views more  TKDE 2010»
15 years 20 days ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...
IMC
2010
ACM
15 years 7 days ago
What happened in my network: mining network events from router syslogs
Router syslogs are messages that a router logs to describe a wide range of events observed by it. They are considered one of the most valuable data sources for monitoring network ...
Tongqing Qiu, Zihui Ge, Dan Pei, Jia Wang, Jun Xu
« Prev « First page 1808 / 1969 Last » Next »