Sciweavers

3105 search results - page 358 / 621
» The Path-Packing Structure of Graphs
Sort
View
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
15 years 4 months ago
Cubical token systems
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...
Sergei Ovchinnikov
DAC
2006
ACM
16 years 5 months ago
SAT sweeping with local observability don't-cares
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
Qi Zhu, Nathan Kitchen, Andreas Kuehlmann, Alberto...
WWW
2004
ACM
16 years 5 months ago
Towards the composition of Ad Hoc B2B Applications: Semantics, Properties and Complexity Management
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
Jaime Delgado, Rosa Gil, Zièd Choukair
KDD
2001
ACM
262views Data Mining» more  KDD 2001»
16 years 5 months ago
LOGML: Log Markup Language for Web Usage Mining
Web Usage Mining refers to the discovery of interesting information from user navigational behavior as stored in web access logs. While extracting simple information from web logs...
John R. Punin, Mukkai S. Krishnamoorthy, Mohammed ...
151
Voted
MOBIHOC
2007
ACM
16 years 4 months ago
Approximation algorithms for longest-lived directional multicast communications in WANETs
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
Song Guo, Oliver W. W. Yang, Victor C. M. Leung