Sciweavers

653 search results - page 90 / 131
» The size of minimum 3-trees
Sort
View
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
15 years 4 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
WCE
2007
15 years 1 months ago
A Distributed Energy Efficient Query Processing in Self-Organized Wireless Sensor Networks
—Spatial query execution is an essential functionality of a sensor network. Redundancy within a sensor network can be exploited to reduce the communication cost incurred in execu...
Meer A. Hamza, Sherin M. Youssef, Salma F. Fayed
IANDC
2008
92views more  IANDC 2008»
14 years 12 months ago
Tree exploration with advice
We study the amount of knowledge about the network that is required in order to efficiently solve a task concerning this network. The impact of available information on the effici...
Pierre Fraigniaud, David Ilcinkas, Andrzej Pelc
EAAI
2006
189views more  EAAI 2006»
14 years 12 months ago
Evolutionary algorithms for VLSI multi-objective netlist partitioning
The problem of partitioning appears in several areas ranging from VLSI, parallel programming, to molecular biology. The interest in finding an optimal partition especially in VLSI ...
Sadiq M. Sait, Aiman H. El-Maleh, Raslan H. Al-Aba...
IJFCS
2008
102views more  IJFCS 2008»
14 years 12 months ago
Succinct Minimal Generators: Theoretical Foundations and Applications
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...
Tarek Hamrouni, Sadok Ben Yahia, Engelbert Mephu N...