2850 search results - page 321 / 570 » On Timed Models and Full Abstraction |
182
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
159
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We introduce a novel representation for the graph colouring problem, called the Integer Merge Model, which aims to reduce the time complexity of an algorithm. Moreover, o...
303
click to vote
ICDT
1995
ACM
15 years 10 months ago
1995
ACM
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
191
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
178
click to vote
ISTA
2008
15 years 8 months ago
2008
Abstract. Service-oriented Computing and Service-oriented Architectures aspire to better exploit existing middleware technologies. To this end, a more flexible, platform independen...