Sciweavers

10608 search results - page 2102 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
13 years 7 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
TWC
2008
133views more  TWC 2008»
13 years 7 months ago
Beam Selection Strategies for Orthogonal Random Beamforming in Sparse Networks
Abstract--Orthogonal random beamforming (ORB) constitutes a mean to exploit spatial multiplexing and multi-user diversity (MUD) gains in multi-antenna broadcast channels. To do so,...
José López Vicario, Roberto Bosisio,...
VC
2008
162views more  VC 2008»
13 years 7 months ago
Realization of Seurat's pointillism via non-photorealistic rendering
Photorealistic rendering is one of the oldest and most important research areas in computer graphics. More recently, the concept of nonphotorealistic rendering has been proposed as...
Chuan-Kai Yang, Hui-Lin Yang
AI
2002
Springer
13 years 7 months ago
The size distribution for Markov equivalence classes of acyclic digraph models
Bayesian networks, equivalently graphical Markov models determined by acyclic digraphs or ADGs (also called directed acyclic graphs or dags), have proved to be both effective and ...
Steven B. Gillispie, Michael D. Perlman
LOGCOM
2007
130views more  LOGCOM 2007»
13 years 7 months ago
A Logic for Concepts and Similarity
Categorisation of objects into classes is currently supported by (at least) two ‘orthogonal’ methods. In logic-based approaches, classifications are defined through ontologi...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
« Prev « First page 2102 / 2122 Last » Next »