Sciweavers

5473 search results - page 866 / 1095
» On the graph isomorphism problem
Sort
View
AICCSA
2007
IEEE
84views Hardware» more  AICCSA 2007»
16 years 26 days ago
Encoding Algorithms for Logic Synthesis
This paper presents an encoding algorithm that is very efficient for many different logic synthesis problems. The algorithm is based on the use of special tables and includes two ...
Valery Sklyarov, Iouliia Skliarova
GLOBECOM
2007
IEEE
16 years 26 days ago
On High Spatial Reuse Link Scheduling in STDMA Wireless Ad Hoc Networks
— Graph-based algorithms for point-to-point link scheduling in Spatial reuse Time Division Multiple Access (STDMA) wireless ad hoc networks often result in a significant number ...
Ashutosh Deepak Gore, Abhay Karandikar, Srikanth J...
ICDIM
2007
IEEE
16 years 25 days ago
Exploiting multi-evidence from multiple user's interests to personalizing information retrieval
The goal of personalization in information retrieval is to tailor the search engine results to the specific goals, preferences and general interests of the users. We propose a no...
Lynda Tamine-Lechani, Mohand Boughanem, Nesrine Ze...
AGTIVE
2007
Springer
16 years 21 days ago
Applying a Grouping Operator in Model Transformations
The usability of model transformation languages depends on the abstractions one can work with in rules to perform complex operations on models. Recently, we have introduced a novel...
Daniel Balasubramanian, Anantha Narayanan, Sandeep...
COCOON
2007
Springer
16 years 21 days ago
On the Complexity of Finding an Unknown Cut Via Vertex Queries
We investigate the problem of finding an unknown cut through querying vertices of a graph G. Our complexity measure is the number of submitted queries. To avoid some worst cases, ...
Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigi...