Sciweavers

52 search results - page 5 / 11
» Representable Disjoint NP-Pairs
Sort
View
SIGMETRICS
2008
ACM
113views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Layered interval codes for tcam-based classification
Ternary content-addressable memories (TCAMs) are increasingly used for high-speed packet classification. TCAMs compare packet headers against all rules in a classification database...
Anat Bremler-Barr, David Hay, Danny Hendler, Boris...
NIPS
2008
13 years 10 months ago
Multiscale Random Fields with Application to Contour Grouping
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
Longin Jan Latecki, ChengEn Lu, Marc Sobel, Xiang ...
SBBD
2007
116views Database» more  SBBD 2007»
13 years 10 months ago
A Hypergraph Model for Computing Page Reputation on Web Collections
In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets o...
Klessius Berlt, Edleno Silva de Moura, André...
IAJIT
2010
230views more  IAJIT 2010»
13 years 7 months ago
An Unsupervised Artificial Neural Network Method for Satellite Image Segmentation
: Image segmentation is an essential step in image processing. The goal of segmentation is to simplify and/or to change the representation of an image into a form easier to analyze...
Mohamad Awad
CC
2010
Springer
282views System Software» more  CC 2010»
13 years 7 months ago
Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
Nikos Leonardos, Michael Saks