Sciweavers

81 search results - page 8 / 17
» A Geometric Foundation of Colorimetry
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
MOBILWARE
2009
ACM
14 years 2 months ago
Map-Based Compressive Sensing Model for Wireless Sensor Network Architecture, A Starting Point
Sub-Nyquist sampling techniques for Wireless Sensor Networks (WSN) are gaining increasing attention as an alternative method to capture natural events with desired quality while mi...
Mohammadreza Mahmudimanesh, Abdelmajid Khelil, Nas...
COMPGEOM
2005
ACM
13 years 9 months ago
1-link shortest paths in weighted regions
We illustrate the Link Solver software for computing 1-link shortest paths in weighted regions. The Link Solver implements a prune-and-search method that can be used to approximat...
Ovidiu Daescu, James D. Palmer
ENTCS
2006
114views more  ENTCS 2006»
13 years 7 months ago
Open-Source Model Checking
We present GMC2 , a software model checker for GCC, the opensource compiler from the Free Software Foundation (FSF). GMC2 , which is part of the GMC static-analysis and model-check...
Radu Grosu, Xiaowan Huang, Sumit Jain, Scott A. Sm...
PRL
2006
106views more  PRL 2006»
13 years 7 months ago
Invariances in kernel methods: From samples to objects
This paper presents a general method for incorporating prior knowledge into kernel methods such as Support Vector Machines. It applies when the prior knowledge can be formalized b...
Alexei Pozdnoukhov, Samy Bengio