Sciweavers

1006 search results - page 157 / 202
» What is this page known for
Sort
View
APCCM
2006
13 years 10 months ago
Network data mining: methods and techniques for discovering deep linkage between attributes
Network Data Mining identifies emergent networks between myriads of individual data items and utilises special algorithms that aid visualisation of `emergent' patterns and tre...
John Galloway, Simeon J. Simoff
ECIS
2000
13 years 10 months ago
Information Systems Research Education in Australasia: Continuing the Past or Gearing Up for the Future
As the information systems discipline grows, so do the number of programs offering graduate research degrees (GRD). In Australasia these include one year post-graduate (honors) pr...
Beverley G. Hope, M. Fergusson
IJCAI
1989
13 years 10 months ago
Towards a Theory of Conflict Detection and Resolution in Nonlinear Plans
This paper deals with a well known problem in AI planning: detecting and resolving conflicts in nonlinear plans. We sketch a theory of restricted conflict detection and resolution...
Joachim Hertzberg, Alexander Horz
DAM
2008
114views more  DAM 2008»
13 years 8 months ago
Efficient solutions to the braid isotopy problem
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy probl...
Patrick Dehornoy
ECCC
2006
88views more  ECCC 2006»
13 years 8 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna