Sciweavers

6365 search results - page 357 / 1273
» Fast Local Computation Algorithms
Sort
View
SIROCCO
2007
15 years 8 months ago
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
Jurek Czyzowicz, Stefan Dobrev, Evangelos Kranakis...
CVPR
1996
IEEE
16 years 8 months ago
Combining greyvalue invariants with local constraints for object recognition
This paper addresses the problem of recognizing objects in large image databases. The method is based on local characteristics which are invariant to simzlarity transformations in...
Cordelia Schmid, Roger Mohr
EPIA
2001
Springer
15 years 11 months ago
Global Hull Consistency with Local Search for Continuous Constraint Solving
This paper addresses constraint solving over continuous domains in the context of decision making, and discusses the trade-off between precision in the definition of the solution s...
Jorge Cruz, Pedro Barahona
ICCAD
2001
IEEE
107views Hardware» more  ICCAD 2001»
16 years 3 months ago
Fast 3-D Inductance Extraction in Lossy Multi-Layer Substrate
A mixed potential integral equation (MPIE) technique combined with fast multi-layer Green’s functions and Gaussian Jacobi high order techniques is used to compute the 3-D freque...
Minqing Liu, Tiejun Yu, Wayne Wei-Ming Dai
AAAI
2011
14 years 6 months ago
Fast Newton-CG Method for Batch Learning of Conditional Random Fields
We propose a fast batch learning method for linearchain Conditional Random Fields (CRFs) based on Newton-CG methods. Newton-CG methods are a variant of Newton method for high-dime...
Yuta Tsuboi, Yuya Unno, Hisashi Kashima, Naoaki Ok...