Sciweavers

384 search results - page 24 / 77
» Get another label
Sort
View
COMGEO
2008
ACM
13 years 7 months ago
Encompassing colored planar straight line graphs
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba...
CVPR
2007
IEEE
14 years 9 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler
ENGL
2007
148views more  ENGL 2007»
13 years 7 months ago
A General Reflex Fuzzy Min-Max Neural Network
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...
Abhijeet V. Nandedkar, Prabir Kumar Biswas
DAC
1998
ACM
14 years 8 months ago
Code Compression for Embedded Systems
Memory is one of the most restricted resources in many modern embedded systems. Code compression can provide substantial savings in terms of size. In a compressed code CPU, a cach...
Haris Lekatsas, Wayne Wolf
CHI
2008
ACM
14 years 7 months ago
Mind your p's and q's: when politeness helps and hurts in online communities
Little is known about the impact of politeness in online communities. This project combines deductive and inductive approaches to automatically model linguistic politeness in onli...
Moira Burke, Robert Kraut