2907 search results - page 219 / 582 » Presentations of Structures in Admissible Sets |
177
click to vote
ISCAS
2005
IEEE
16 years 5 days ago
2005
IEEE
There are many ways to define richness of a discrete time signal. In this paper we consider a particular definition and explore the conditions under which a linear time invarian...
183
click to vote
ISIPTA
2005
IEEE
16 years 5 days ago
2005
IEEE
Graph-theoretical representations for sets of probability measures (credal networks) generally display high complexity, and approximate inference seems to be a natural solution fo...
178
click to vote
AWIC
2005
Springer
16 years 4 days ago
2005
Springer
This paper presents an approach for applying inductive logic programming to information extraction from HTML documents structured as unranked ordered trees. We consider information...
167
click to vote
ICWE
2005
Springer
16 years 3 days ago
2005
Springer
We present in this paper a method to discover the set of webpages contained in a logical website, based on the link structure of the Web graph. Such a method is useful in the conte...
169
click to vote
ECOOP
2004
Springer
15 years 12 months ago
2004
Springer
The expression problem (aka the extensibility problem) refers to a fundamental dilemma of programming: Can your application be structured in such a way that both the data model and...