Sciweavers

2778 search results - page 54 / 556
» Limit complexities revisited
Sort
View
CASC
2011
Springer
262views Mathematics» more  CASC 2011»
13 years 11 months ago
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
William Hart, Andrew Novocin
CONEXT
2008
ACM
15 years 1 months ago
Internet traffic classification demystified: myths, caveats, and the best practices
Recent research on Internet traffic classification algorithms has yielded a flurry of proposed approaches for distinguishing types of traffic, but no systematic comparison of the ...
Hyunchul Kim, Kimberly C. Claffy, Marina Fomenkov,...
EUROCOLT
1995
Springer
15 years 3 months ago
The structure of intrinsic complexity of learning
Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (fr...
Sanjay Jain, Arun Sharma
ENTCS
2006
112views more  ENTCS 2006»
14 years 11 months ago
Interface Automata with Complex Actions
Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in componentbased systems, we ...
Shahram Esmaeilsabzali, Farhad Mavaddat, Nancy A. ...
IROS
2009
IEEE
155views Robotics» more  IROS 2009»
15 years 6 months ago
Human-robot team navigation in visually complex environments
—Current fully autonomous robots are unable to navigate effectively in visually complex environments due to limitations in sensing and cognition. Full teleoperation using current...
John Carff, Matthew Johnson, Eman El-Sheikh, Jerry...