Sciweavers

3471 search results - page 387 / 695
» Obstacle Numbers of Graphs
Sort
View
IJWMC
2007
111views more  IJWMC 2007»
15 years 6 months ago
Adaptive semi-soft handoff for Cellular IP networks
—Rapid advances in wireless networking have led to more mobile phones, PDAs, and other digital mobile devices becoming ubiquitously connected to the Internet. As the demand of de...
Eriko Nurvitadhi, Ben Lee, Chansu Yu, Myungchul Ki...
TROB
2010
129views more  TROB 2010»
15 years 5 months ago
A Probabilistic Particle-Control Approximation of Chance-Constrained Stochastic Predictive Control
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
Lars Blackmore, Masahiro Ono, Askar Bektassov, Bri...
ECCC
2010
83views more  ECCC 2010»
15 years 4 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...
LATIN
1998
Springer
15 years 11 months ago
Improved Approximate Pattern Matching on Hypertext
The problem of approximate pattern matching on hypertext is de ned and solved by Amir et al. in O(m(nlogm + e)) time, where m is the length of the pattern, n is the total text size...
Gonzalo Navarro
BPM
2006
Springer
206views Business» more  BPM 2006»
15 years 10 months ago
A Discourse on Complexity of Process Models
Complexity has undesirable effects on, among others, the correctness, maintainability, and understandability of business process models. Yet, measuring complexity of business proce...
Jorge Cardoso, Jan Mendling, Gustaf Neumann, Hajo ...