Sciweavers

1094 search results - page 45 / 219
» One Size Fits All
Sort
View
BIRTHDAY
2010
Springer
15 years 7 months ago
From Nondeterministic Suffix Automaton to Lazy Suffix Tree
Given two strings, a pattern P of length m and a text T of length n over some alphabet of size , we consider the exact string matching problem, i.e. we want to report all occurren...
Kimmo Fredriksson
112
Voted
COMBINATORICA
2008
87views more  COMBINATORICA 2008»
15 years 4 months ago
Quasi-randomness and the distribution of copies of a fixed graph
We show that if a graph G has the property that all subsets of vertices of size n/4 contain the "correct" number of triangles one would expect to find in a random graph ...
Asaf Shapira
AAAI
2010
15 years 5 months ago
Compilation Complexity of Common Voting Rules
In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
Lirong Xia, Vincent Conitzer
ICML
2000
IEEE
16 years 5 months ago
Less is More: Active Learning with Support Vector Machines
We describe a simple active learning heuristic which greatly enhances the generalization behavior of support vector machines (SVMs) on several practical document classification ta...
Greg Schohn, David Cohn
COMPGEOM
2004
ACM
15 years 7 months ago
Intersecting quadrics: an efficient and exact implementation
We present the first complete, exact, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It...
Sylvain Lazard, Luis Mariano Peñaranda, Syl...