Sciweavers

1361 search results - page 104 / 273
» Spaces of practice
Sort
View
SODA
1993
ACM
202views Algorithms» more  SODA 1993»
15 years 5 months ago
Approximate Nearest Neighbor Queries in Fixed Dimensions
Given a set of n points in d-dimensional Euclidean space, S ⊂ Ed , and a query point q ∈ Ed , we wish to determine the nearest neighbor of q, that is, the point of S whose Euc...
Sunil Arya, David M. Mount
BIBE
2007
IEEE
174views Bioinformatics» more  BIBE 2007»
15 years 10 months ago
Shortest Path Approaches for the Longest Common Subsequence of a Set of Strings
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
POS
1987
Springer
15 years 7 months ago
Realisation of a Dynamically Grouped Object-Oriented Virtual Memory Hierarchy
Conventional paging systems do not perform well with large object-oriented environments (such as Smalltalk-801 [GR83]) due to the fine granularity of objects and the persistence o...
Ifor Williams, Mario Wolczko, T. P. Hopkins
SP
2008
IEEE
15 years 10 months ago
Preventing Memory Error Exploits with WIT
Attacks often exploit memory errors to gain control over the execution of vulnerable programs. These attacks remain a serious problem despite previous research on techniques to pr...
Periklis Akritidis, Cristian Cadar, Costin Raiciu,...
CDC
2009
IEEE
131views Control Systems» more  CDC 2009»
15 years 8 months ago
An algebraic approach for the NCE principle with massive subpopulations
— We study large population stochastic dynamic games where each agent receives influences from multi-classes of agents according to intra- and inter-subpopulation cost coupling....
Minyi Huang