Sciweavers

11394 search results - page 2157 / 2279
» Error-Correcting Data Structures
Sort
View
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 3 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
135
Voted
SPAA
2004
ACM
15 years 8 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
SIGGRAPH
1990
ACM
15 years 7 months ago
Rapid controlled movement through a virtual 3D workspace
not abstract asymmetry: different sides looks different clumps different from "data objects" need grid structure, alignment [Design Guidelines for Landmarks to Support Na...
Jock D. Mackinlay, Stuart K. Card, George G. Rober...
BMCBI
2008
112views more  BMCBI 2008»
15 years 3 months ago
Predicting the Interactome of Xanthomonas oryzae pathovar oryzae for target selection and DB service
Background: Protein-protein interactions (PPIs) play key roles in various cellular functions. In addition, some critical inter-species interactions such as host-pathogen interacti...
Jeong-Gu Kim, Daeui Park, Byoung-Chul Kim, Seong-W...
FUN
2010
Springer
312views Algorithms» more  FUN 2010»
15 years 8 months ago
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, ...
« Prev « First page 2157 / 2279 Last » Next »