Sciweavers

1756 search results - page 237 / 352
» Directed scale-free graphs
Sort
View
ESA
1998
Springer
169views Algorithms» more  ESA 1998»
15 years 10 months ago
Augmenting Suffix Trees, with Applications
Information retrieval and data compression are the two main application areas where the rich theory of string algorithmics plays a fundamental role. In this paper, we consider one ...
Yossi Matias, S. Muthukrishnan, Süleyman Cenk...
KES
1998
Springer
15 years 10 months ago
Intensity reasoning by constraint propagation based on causal relationships
Many events in the world occur with some quantity that shows a level of the occurrence. This paper discusses reasoning with the normalized level of the occurrence, which we call i...
Koichi Yamada
INFOCOM
1993
IEEE
15 years 10 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 10 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 9 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,...