Sciweavers

1068 search results - page 167 / 214
» On Space Bounded Server Algorithms
Sort
View
MOBICOM
2012
ACM
11 years 10 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
CVPR
2006
IEEE
14 years 10 months ago
Noise Estimation from a Single Image
In order to work well, many computer vision algorithms require that their parameters be adjusted according to the image noise level, making it an important quantity to estimate. W...
Ce Liu, William T. Freeman, Richard Szeliski, Sing...
ICML
2004
IEEE
14 years 8 months ago
SVM-based generalized multiple-instance learning via approximate box counting
The multiple-instance learning (MIL) model has been very successful in application areas such as drug discovery and content-based imageretrieval. Recently, a generalization of thi...
Qingping Tao, Stephen D. Scott, N. V. Vinodchandra...
CADE
2001
Springer
14 years 8 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
14 years 2 months ago
ORIGAMI: Mining Representative Orthogonal Graph Patterns
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, J&e...