Sciweavers

2436 search results - page 198 / 488
» Comonadic Notions of Computation
Sort
View
RANDOM
1998
Springer
15 years 9 months ago
A Derandomization Using Min-Wise Independent Permutations
abstract for submission to Random '98 not for distribution Andrei Z. Broder Moses Charikar Michael Mitzenmacher Min-wise independence is a recently introduced notion of limit...
Andrei Z. Broder, Moses Charikar, Michael Mitzenma...
VISUALIZATION
1997
IEEE
15 years 9 months ago
Visualization of rotation fields
We define a rotation field by extending the notion of a vector field to rotations. A vector field has a vector as a value at each point of its domain; a rotation field has a ...
Mark A. Livingston
COMPGEOM
1997
ACM
15 years 8 months ago
Time-Series Similarity Problems and Well-Separated Geometric Sets
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
Béla Bollobás, Gautam Das, Dimitrios...
GROUP
1997
ACM
15 years 8 months ago
Team automata for groupware systems
Team automata have been proposed in Ellis (1997) as a formal framework for modeling both the conceptual and the architectural level of groupware systems. Here we define team autom...
Clarence A. Ellis
COCO
1994
Springer
89views Algorithms» more  COCO 1994»
15 years 8 months ago
Relationships Among PL, #L, and the Determinant
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...
Eric Allender, Mitsunori Ogihara