Sciweavers

4302 search results - page 56 / 861
» Index Pairs Algorithms
Sort
View
KBSE
2010
IEEE
13 years 6 months ago
An automated approach for finding variable-constant pairing bugs
Named constants are used heavily in operating systems code, both as internal flags and in interactions with devices. Decision making within an operating system thus critically de...
Julia L. Lawall, David Lo
VLDB
2002
ACM
116views Database» more  VLDB 2002»
13 years 7 months ago
Updates for Structure Indexes
The problem of indexing path queries in semistructured/XML databases has received considerable attention recently, and several proposals have advocated the use of structure indexe...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
Type Systems for Optimizing Stack-based Code
We give a uniform type-systematic account of a number of optimizations and the underlying analyses for a bytecode-like stack-based low-level language, including analysis soundness...
Ando Saabas, Tarmo Uustalu
ISAAC
1992
Springer
186views Algorithms» more  ISAAC 1992»
13 years 11 months ago
Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs
Let G be an undirected plane graph with non-negative edge length, and let k terminal pairs lie on two specified face boundaries. This paper presents an algorithm for finding k &quo...
Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki
EACL
2006
ACL Anthology
13 years 9 months ago
Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing
An algorithm based on the Generalized Hebbian Algorithm is described that allows the singular value decomposition of a dataset to be learned based on single observation pairs pres...
Genevieve Gorrell