Sciweavers

12697 search results - page 266 / 2540
» Call for Papers
Sort
View
TCS
2008
15 years 6 months ago
On different generalizations of episturmian words
In this paper we study some classes of infinite words generalizing episturmian words, and analyse the relations occurring among such classes. In each case, the reversal operator R...
Michelangelo Bucci, Aldo de Luca, Alessandro De Lu...
TJS
2002
83views more  TJS 2002»
15 years 6 months ago
An I/O-Conscious Tiling Strategy for Disk-Resident Data Sets
This paper describes a tiling technique that can be used by application programmers and optimizing compilers to obtain I/O-efficient versions of regular scientific loop nests. Due ...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
EMNLP
2009
15 years 4 months ago
Hypernym Discovery Based on Distributional Similarity and Hierarchical Structures
This paper presents a new method of developing a large-scale hyponymy relation database by combining Wikipedia and other Web documents. We attach new words to the hyponymy databas...
Ichiro Yamada, Kentaro Torisawa, Jun'ichi Kazama, ...
CORR
2010
Springer
102views Education» more  CORR 2010»
15 years 1 months ago
Superior Exploration-Exploitation Balance with Quantum-Inspired Hadamard Walks
This paper extends the analogies employed in the development of quantum-inspired evolutionary algorithms by proposing quantum-inspired Hadamard walks, called QHW. A novel quantum-...
Sisir Koppaka, Ashish Ranjan Hota
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Petr Kolman, Christian Scheideler