Sciweavers

8337 search results - page 1336 / 1668
» Reasoning With Characteristic Models
Sort
View
TMC
2012
13 years 9 months ago
Fast Data Collection in Tree-Based Wireless Sensor Networks
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
Özlem Durmaz Incel, Amitabha Ghosh, Bhaskar K...
ECCV
2002
Springer
16 years 8 months ago
Composite Texture Descriptions
Textures can often more easily be described as a composition of subtextures than as a single texture. The paper proposes a way to model and synthesize such "composite textures...
Alexey Zalesny, Vittorio Ferrari, Geert Caenen, Do...
GIS
2004
ACM
16 years 7 months ago
Algorithms for the placement of diagrams on maps
This paper discusses a variety of ways to place diagrams like pie charts on maps, in particular, administrative subdivisions. The different ways come from different models of the ...
Étienne Schramm, Alexander Wolff, Marc J. v...
BPM
2009
Springer
340views Business» more  BPM 2009»
16 years 1 months ago
Abstractions in Process Mining: A Taxonomy of Patterns
ions in Process Mining: A Taxonomy of Patterns R.P. Jagadeesh Chandra Bose1,2 and Wil M.P. van der Aalst1 1 Department of Mathematics and Computer Science, University of Technology...
R. P. Jagadeesh Chandra Bose, Wil M. P. van der Aa...
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
16 years 1 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
« Prev « First page 1336 / 1668 Last » Next »