Sciweavers

143 search results - page 21 / 29
» ams 2007
Sort
View
4OR
2004
90views more  4OR 2004»
13 years 9 months ago
A MIP approach for some practical packing problems: Balancing constraints and tetris-like items
This paper considers packing problems with balancing conditions and items consisting of clusters of parallelepipeds (mutually orthogonal, i.e. tetris-like items). This issue is qu...
Giorgio Fasano
AAAI
2007
14 years 5 days ago
A Robot That Uses Existing Vocabulary to Infer Non-Visual Word Meanings from Observation
The authors present TWIG, a visually grounded wordlearning system that uses its existing knowledge of vocabulary, grammar, and action schemas to help it learn the meanings of new ...
Kevin Gold, Brian Scassellati
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
14 years 4 months ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
NETWORK
2007
100views more  NETWORK 2007»
13 years 9 months ago
Parallel Programmable Ethernet Controllers: Performance and Security
Programmable network interfaces can provide network servers with a flexible interface to high-bandwidth Ethernet links, but they face critical software and architectural challenge...
Derek L. Schuff, Vijay S. Pai, Paul Willmann, Scot...
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 9 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap