Sciweavers

539 search results - page 21 / 108
» Recurrence relations and fast algorithms
Sort
View
INFORMATICALT
1998
89views more  INFORMATICALT 1998»
15 years 1 days ago
Simply Invertible Matrices and Fast Prediction
Abstract. We study invertibility of big n × n matrices. There exists a number of algorithms, especially in mathematical statistics and numerical mathematics, requiring to invert s...
Valdas Diciunas
102
Voted
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
15 years 4 months ago
Compressing Relations and Indexes
We propose a new compression algorithm that is tailored to database applications. It can be applied to a collection of records, and is especially e ective for records with many lo...
Jonathan Goldstein, Raghu Ramakrishnan, Uri Shaft
95
Voted
CDC
2008
IEEE
116views Control Systems» more  CDC 2008»
15 years 6 months ago
Effective sensing regions and connectivity of agents undergoing periodic relative motions
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
Daniel T. Swain, Ming Cao, Naomi Ehrich Leonard
212
Voted
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
16 years 1 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
ANNPR
2008
Springer
15 years 2 months ago
Patch Relational Neural Gas - Clustering of Huge Dissimilarity Datasets
Clustering constitutes an ubiquitous problem when dealing with huge data sets for data compression, visualization, or preprocessing. Prototype-based neural methods such as neural g...
Alexander Hasenfuss, Barbara Hammer, Fabrice Rossi