Sciweavers

1736 search results - page 245 / 348
» The rank-width of Directed Graphs
Sort
View
INFOCOM
1993
IEEE
15 years 8 months ago
Power-Optimal Layout of Passive, Single-Hop, Fiber-Optic Interconnections Whose Capacity Increases with the Number of Stations
Passive, single-hop interconnections among N stations, each with several transmitters and receivers, provide a communication path between any two stations using one of the transmi...
Yitzhak Birk
ICRA
1994
IEEE
102views Robotics» more  ICRA 1994»
15 years 8 months ago
Sensor-Based Planning and Nonsmooth Analysis
This paper describes some initial steps towards sensor based path planning in an unknown static environment. The method is a based on a sensor-based incremental construction of a o...
Howie Choset, Joel W. Burdick
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
15 years 8 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...
DEXA
2007
Springer
114views Database» more  DEXA 2007»
15 years 8 months ago
Data Management for Mobile Ajax Web 2.0 Applications
Whenever Ajax applications on mobile devices have to retrieve large XML data fragments from a remote server, a reduction of the exchanged data volume may be crucial to manage limit...
Stefan Böttcher, Rita Steinmetz
CLOUDCOM
2009
Springer
15 years 8 months ago
Cost-Minimizing Scheduling of Workflows on a Cloud of Memory Managed Multicore Machines
Workflows are modeled as hierarchically structured directed acyclic graphs in which vertices represent computational tasks, referred to as requests, and edges represent precedent c...
Nicolas G. Grounds, John K. Antonio, Jeffrey T. Mu...