Sciweavers

2778 search results - page 190 / 556
» Limit complexities revisited
Sort
View
ISBI
2006
IEEE
16 years 7 months ago
Incremental learning for segmentation in medical images
Hand-coded vision systems are problematic in complex medical domains and are hard to change as new information emerges. Knowledge-Engineering and Machine Learning approaches to in...
Avishkar Misra, Arcot Sowmya, Paul Compton
VLSID
2004
IEEE
108views VLSI» more  VLSID 2004»
16 years 7 months ago
Boolean Decomposition Using Two-literal Divisors
This paper is an attempt to answer the following question: how much improvement can be obtained in logic decomposition by using Boolean divisors? Traditionally, the existence of t...
Nilesh Modi, Jordi Cortadella
OSDI
2008
ACM
16 years 6 months ago
An Internet Protocol Address Clustering Algorithm
We pose partitioning a b-bit Internet Protocol (IP) address space as a supervised learning task. Given (IP, property) labeled training data, we develop an IP-specific clustering a...
Robert Beverly, Karen R. Sollins
SIGMOD
2003
ACM
129views Database» more  SIGMOD 2003»
16 years 6 months ago
Efficient Processing of Joins on Set-valued Attributes
Object-oriented and object-relational DBMS support setvalued attributes, which are a natural and concise way to model complex information. However, there has been limited research...
Nikos Mamoulis
EDBT
2006
ACM
150views Database» more  EDBT 2006»
16 years 6 months ago
Improving the Efficiency of XPath Execution on Relational Systems
: This work describes a method for processing XPath on a relational back-end that significantly limits the number of SQL joins required, takes advantage of the strengths of modern ...
Haris Georgiadis, Vasilis Vassalos