Sciweavers

962 search results - page 39 / 193
» Efficient Algorithms for Eulerian Extension
Sort
View
ICFP
2008
ACM
15 years 9 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
LCN
2005
IEEE
15 years 3 months ago
Constructing Efficient Multi-hop Mesh Networks
The Wireless Channel-oriented Ad-hoc Multi-hop Broadband (W-CHAMB) is a new link layer protocol with the aim of being able to support Quality of Service (QoS) in multi-hop operati...
Rui Zhao, Bernhard Walke, Michael Einhaus
APWEB
2006
Springer
15 years 1 months ago
Efficient Mining Strategy for Frequent Serial Episodes in Temporal Database
Discovering patterns with great significance is an important problem in data mining discipline. A serial episode is defined to be a partially ordered set of events for consecutive ...
Kuo-Yu Huang, Chia-Hui Chang
VLDB
1997
ACM
170views Database» more  VLDB 1997»
15 years 1 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula
CORR
2011
Springer
145views Education» more  CORR 2011»
14 years 4 months ago
Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants
In the paper, the global optimization problem of a multidimensional “black-box” function satisfying the Lipschitz condition over a hyperinterval with an unknown Lipschitz const...
Yaroslav D. Sergeyev, Dmitri E. Kvasov