Sciweavers

1995 search results - page 140 / 399
» From Data Flow Networks to Process Algebras
Sort
View
AUTOMATICA
2008
139views more  AUTOMATICA 2008»
15 years 4 months ago
Structured low-rank approximation and its applications
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
Ivan Markovsky
LCN
1996
IEEE
15 years 8 months ago
An Enhanced Timed-Round-Robin Traffic Control Scheme for ATM Networks
ATM (asynchronous transfer mode) aims at providing both guaranteed bandwidth to support real-time communications and dynamic bandwidth sharing to accommodate bursty data traffic. ...
Qin Zheng
CIKM
2009
Springer
15 years 8 months ago
Efficient processing of group-oriented connection queries in a large graph
We study query processing in large graphs that are fundamental data model underpinning various social networks and Web structures. Given a set of query nodes, we aim to find the g...
James Cheng, Yiping Ke, Wilfred Ng
AUSDM
2007
Springer
185views Data Mining» more  AUSDM 2007»
15 years 10 months ago
An Approach to Argumentation Context Mining from Dialogue History in an E-Market Scenario
Argumentation allows agents to exchange additional information to argue about their beliefs and other mental attitudes during the negotiation process. Utterances and subsequent obs...
Khandaker Shahidul Islam
SIGMOD
2001
ACM
135views Database» more  SIGMOD 2001»
16 years 4 months ago
The Network is the Database: Data Management for Highly Distributed Systems
This paper describes the methodology and implementation of a data management system for highly distributed systems, which was built to solve the scalability and reliability proble...
Julio C. Navas, Michael J. Wynblatt