INFOSCALE
2007
ACM
14 years 2 months ago
2007
ACM
— Since sequential patterns may exist in multiple sequence databases, we propose algorithm PropagatedMine+ to efficiently discover multi-domain sequential patterns. Prior works ...
VISSYM
2007
14 years 3 months ago
2007
Lattice graphs are used as underlying data structures in many statistical processing systems, including natural language processing. Lattices compactly represent multiple possible...
CISM
1993
14 years 4 months ago
1993
The weak instance model is a framework to consider the relations in a database as a whole, regardless of the way attributes are grouped in the individual relations. Queries and upd...
FLOPS
1999
Springer
14 years 5 months ago
1999
Springer
We present a simple generic framework to solve constraints on any domain (finite or infinite) which has a lattice structure. The approach is based on the use of a single constrai...
ICC
2007
IEEE
14 years 7 months ago
2007
IEEE
— Traditional multiple-antenna detectors – which search a tree or a lattice structure – typically apply a metric that requires a preprocessing. Contrary to that, we present a...
ICC
2007
IEEE
14 years 7 months ago
2007
IEEE
— Wireless sensor networks (WSNs) usually have a regular lattice structure and can be considered as multi-hop multi-route networks. In multi-route transmissions, even if the link...
HAPTICS
2007
IEEE
14 years 7 months ago
2007
IEEE
We are developing a novel sensing device named “3-dimensional capture sheet (3DCS)”. The cloth-like sheet measures its own 3D configuration. The sheet enables us to make a sof...